Time versus cost tradeoffs for deterministic rendezvous in networks
نویسندگان
چکیده
منابع مشابه
Tradeoffs between Cost and Information for Rendezvous and Treasure Hunt
In rendezvous, two agents traverse network edges in synchronous rounds and have to meet at some node. In treasure hunt, a single agent has to find a stationary target situated at an unknown node of the network. We study tradeoffs between the amount of information (advice) available a priori to the agents and the cost (number of edge traversals) of rendezvous and treasure hunt. Our goal is to fi...
متن کاملAsymptotically Optimal Deterministic Rendezvous
In this paper, we address the deterministic rendezvous in graphs where k mobile agents, disseminated at different times and different nodes, have to meet in finite time at the same node. The mobile agents are autonomous, oblivious, labeled, and move asynchronously. Moreover, we consider an undirected anonymous connected graph. For this problem, we exhibit some asymptotical time and space lower ...
متن کاملCost vs. Quality: Tradeoffs in Communication Networks
This research studies design and optimization problems in communication networks. The goal is to design network structures and routing algorithms with good quality and low cost. A communication network is composed of a set of users connected by communication lines. Users communicate by sending information on the lines. Routing algorithms determine the routes in the network that the information ...
متن کاملAsynchronous Deterministic Rendezvous in Graphs
Two mobile agents (robots) having distinct labels and located in nodes of an unknown anonymous connected graph, have to meet. We consider the asynchronous version of this well-studied rendezvous problem and we seek fast deterministic algorithms for it. Since in the asynchronous setting meeting at a node, which is normally required in rendezvous, is in general impossible, we relax the demand by ...
متن کاملAsynchronous Deterministic Rendezvous in Bounded Terrains
Two mobile agents (robots) have to meet in an a priori unknown bounded terrain modeled as a polygon, possibly with polygonal obstacles. Robots are modeled as points, and each of them is equipped with a compass. Compasses of robots may be incoherent. Robots construct their routes, but the actual walk of each robot is decided by the adversary that may, e.g., speed up or slow down the robot. We co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2015
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-015-0253-8